E-MACSC: A novel dynamic cache tuning technique to reduce information retrieval roundtrip time over the Internet
نویسندگان
چکیده
The novel technique proposed in this paper for dynamic cache size tuning is an enhancement of the previous MACSC (Model for Adaptive Cache Size Control) approach. Similar to its MACSC predecessor the Enhanced MACSC (E-MACSC) technique consistently maintains the given cache hit ratio. The focus of the research is presently on supporting small caching systems of limited recyclable memory resources. The MACSC tunes the cache size adaptively with the instantaneous popularity ratio, which is computed statistically by the point-estimate (PE) method on the fly. It is difficult to harness the PE convergence time, because the following are unpredictable: (a) the number of data samples needed by the PE process to achieve convergence and (b) the inter-arrival times among these data samples. In the E-MACSC framework this unpredictability problem is resolved by replacing PE with the MRT mechanism, which is a realization of the Convergence Algorithm (CA). Therefore the E-MACSC is also called the MACSC(MRT) as compared to the original PE-based MACSC or MACSC(PE). The CA is an IEPM (Internet End-to-End Performance Measurement) technique that measures the mean of a waveform quickly and accurately. The CA prediction accuracy, however, differs from other IEPM techniques, because it is independent of the type of waveform/distribution. This independence arises from the fact that CA is based on the Central Limit Theorem. The E-MACSC approach provides several benefits as follows: (a) it maintains the prescribed hit ratio efficaciously, (b) it lessens cache size oscillation, and (c) it uses a fixed number of data samples and this makes its computation time more predictable. The E-MACSC is unique because of the following reasons: (a) it utilizes the relative popularity of the data objects as the sole control parameter and (b) it tunes the cache size adaptively by direct data measurement with the CA support. The relative popularity profile of data objects is called popularity distribution (PD) in the E-MACSC context. Any change in the PD’s standard deviation indicates a shift of user preference for particular data objects. Monitoring and leveraging this change is the basis for E-MACSC to find a meaningful popularity ratio for deciding how the cache size should be tuned in a dynamic manner. q 2005 Published by Elsevier B.V.
منابع مشابه
E-MACSC: A Novel Dynamic Cache Tuning Technique to Maintain the Prescribed Minimum Hit Ratio Consistently for Internet/WWW Applications
The novel E-MACSC technique is for efficacious dynamic cache tuning. It is an enhanced version of the previous MACSC (model for adaptive cache size control) approach by eliminating the unpredictable time elements. The enhancement is achieved by substituting the point-estimate method adopted by the MACSC with the MRT, which is a micro IEPM (Internet End-to-End Performance Measurement) technique....
متن کاملE-MACSC: A Novel Dynamic Cache Tuning Technique to Maintain the Hit Ratio Prescribed by the User in Internet Applications
The E-MACSC (Enhanced Model for Adaptive Cache Size Control) is a novel approach for dynamic cache tuning. The aim is to adaptively tune the cache size at runtime to maintain the prescribed hit ratio. It works with the popularity ratio (PR), defined by the standard deviations sampled for the relative popularity profile of the data objects at two successive time points. The changes in the PR val...
متن کاملImprove Replica Placement in Content Distribution Networks with Hybrid Technique
The increased using of the Internet and its accelerated growth leads to reduced network bandwidth and the capacity of servers; therefore, the quality of Internet services is unacceptable for users while the efficient and effective delivery of content on the web has an important role to play in improving performance. Content distribution networks were introduced to address this issue. Replicatin...
متن کاملAn Improvement over Random Early Detection Algorithm: A Self-Tuning Approach
Random Early Detection (RED) is one of the most commonly used Active Queue Management (AQM) algorithms that is recommended by IETF for deployment in the network. Although RED provides low average queuing delay and high throughput at the same time, but effectiveness of RED is highly sensitive to the RED parameters setting. As network condition varies largely, setting RED's parameters with fixed ...
متن کاملImage Retrieval Using Dynamic Weighting of Compressed High Level Features Framework with LER Matrix
In this article, a fabulous method for database retrieval is proposed. The multi-resolution modified wavelet transform for each of image is computed and the standard deviation and average are utilized as the textural features. Then, the proposed modified bit-based color histogram and edge detectors were utilized to define the high level features. A feedback-based dynamic weighting of shap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computer Communications
دوره 29 شماره
صفحات -
تاریخ انتشار 2006